Communal Partitions of Integers

نویسندگان

  • Darren B. Glass
  • Darren B Glass
چکیده

There is a well-known formula due to Andrews that counts the number of incongruent triangles with integer sides and a fixed perimeter. In this note, we consider the analagous question counting the number of k-tuples of nonnegative integers none of which is more than 1/(k−1) of the sum of all the integers. We give an explicit function for the generating function which counts these k-tuples in the case where they are ordered, unordered, or partially ordered. Finally, we discuss the application to algebraic geometry which motivated this question. Required Publisher's Statement The original version is available from the publisher at: http://www.westga.edu/~integers/cgi-bin/get.cgi This article is available at The Cupola: Scholarship at Gettysburg College: http://cupola.gettysburg.edu/mathfac/3 #A70 INTEGERS 11 (2011) COMMUNAL PARTITIONS OF INTEGERS Darren B Glass Department of Mathematics, Gettysburg College, Gettysburg, Pennsylvania [email protected] Received: 6/28/11, Revised: 8/26/11, Accepted: 11/22/11, Published: 12/7/11 Abstract There is a well-known formula due to Andrews that counts the number of incongruent triangles with integer sides and a fixed perimeter. In this note, we consider the analagous question counting the number of k-tuples of nonnegative integers none of which is more than 1 k−1 of the sum of all the integers. We give an explicit function for the generating function which counts these k-tuples in the case where they are ordered, unordered, or partially ordered. Finally, we discuss the application to algebraic geometry which motivated this question.There is a well-known formula due to Andrews that counts the number of incongruent triangles with integer sides and a fixed perimeter. In this note, we consider the analagous question counting the number of k-tuples of nonnegative integers none of which is more than 1 k−1 of the sum of all the integers. We give an explicit function for the generating function which counts these k-tuples in the case where they are ordered, unordered, or partially ordered. Finally, we discuss the application to algebraic geometry which motivated this question.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INTEGERS 11 A ( 2011 ) Proceedings of Integers Conference 2009 RECURSIVELY SELF - CONJUGATE PARTITIONS

A class of partitions that exhibit substantial symmetry, called recursively selfconjugate partitions, are defined and analyzed. They are found to have connections to non-squashing partitions and other combinatorial objects.

متن کامل

Limit Theorems for the Number of Summands in Integer Partitions

Central and local limit theorems are derived for the number of distinct summands in integer partitions, with or without repetitions, under a general scheme essentially due to Meinardus. The local limit theorems are of the form of Cramér-type large deviations and are proved by Mellin transform and the two-dimensional saddle-point method. Applications of these results include partitions into posi...

متن کامل

On the Partitions of a Number into Arithmetic Progressions

The paper investigates the enumeration of the set AP(n) of partitions of a positive integer n in which the nondecreasing sequence of parts form an arithmetic progression. We establish formulas for such partitions, and characterize a class of integers n with the property that the length of every member of AP(n) divides n. We prove that the number of such integers is small.

متن کامل

A Product of Integer Partitions

I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer n. The bijection leads also to a product on partitions that is associative with a natural grading thus defining a free associative algebra on the set of integer partitions. As an outcome of the computati...

متن کامل

Partitions with short sequences and mock theta functions.

P. A. MacMahon was the first to examine integer partitions in which consecutive integers were not allowed as parts. Such partitions may be described as having sequences of length 1. Recently it was shown that partitions containing no sequences of consecutive integers of length k are of interest in seemingly unrelated problems concerning threshold growth models. The object now is to develop the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011